Using the Constructive Genetic Algorithm for Solving the Probabilistic Maximal Covering Location-Allocation Problem
نویسندگان
چکیده
The Maximal Covering Location Problem (MCLP) maximizes the population that has a facility within a maximum travel distance or time. Numerous extensions have been proposed to enhance its applicability, like the probabilistic model for the maximum covering location-allocation with constraint in waiting time or queue length for congested systems, with one or more servers per service center. In this paper we present one solution procedure for that probabilistic model, considering one server per center, using the Constructive Genetic Algorithm. The results of tests on the solution procedure are presented.
منابع مشابه
Efficient Solution Procedure to Develop Maximal Covering Location Problem Under Uncertainty (Using GA and Simulation)
In this paper, we present the stochastic version of Maximal Covering Location Problem which optimizes both location and allocation decisions, concurrently. It’s assumed that traveling time between customers and distribution centers (DCs) is uncertain and described by normal distribution function and if this time is less than coverage time, the customer can be allocated to DC. In classical mod...
متن کاملتوسعه مدل مکان یابی-تخصیص حداکثر پوشش با امکان ایجاد ازدحام در محیط رقابتی مبتنی بر انتخاب مشتری
The main objective of facilities location and service system design is covering of potential customers’ demand. Many location models are extended with the covering objective and considered constraints, details of problem and its different aspects. In this paper the maximal covering location-allocation model for congested system is extended in the competitive environment. In the proposed model, ...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملمدلبندی و حل مساله ماکزیمم پوشش p -هاب تک تخصیصی با پوشش تدریجی
P-hub maximal covering location problem is one of the most commonly used location- allocation problems. In this problem, the goal is to determine the best location for the hubs such that the covered demand is maximized by considering the predefined coverage radius. In classical hub problems, if the distance between the origin and destination is less than this radius, coverage is possible; other...
متن کاملThe Capacitated Location-Allocation Problem with Interval Parameters
In this paper, we develop a capacitated location-covering model considering interval values for demand and service parameters. We also consider flexibility on distance standard for covering demand nodes by the servers. We use the satisfaction degree to represent the constraint of service capacity. The proposed model belongs to the class of mixed integer programming models. Our model can be redu...
متن کامل